Unity in nominal equational reasoning: The algebra of equality on nominal sets
نویسنده
چکیده
There are currently no fewer than four dedicated logics for equality reasoning over nominal sets: nominal algebra, nominal equational logic, nominal equational logic with equality only, and permissive-nominal algebra. In this survey and research paper we present these logics side-by-side in a common notation, survey their similarities and differences, discuss their proofand model-theories, and discuss in detail what the implications of those differences are for mathematical reasoning in each of them.
منابع مشابه
Term Equational Systems and Logics
We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an applic...
متن کاملClosed nominal rewriting and efficiently computable nominal algebra equality
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus and first-order ...
متن کاملTerm Equational Rewrite Systems and Logics
We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to s...
متن کاملClosed nominal rewriting and efficiently computable nominal
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete and efficient procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus an...
متن کاملNominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Logic
دوره 10 شماره
صفحات -
تاریخ انتشار 2012